Accelerated Randomized Coordinate Descent for Solving Linear Systems
نویسندگان
چکیده
The randomized coordinate descent (RCD) method is a simple but powerful approach to solving inconsistent linear systems. In order accelerate this approach, the Nesterov accelerated (NARCD) proposed. with momentum (RCDm) proposed by Nicolas Loizou, we will provide new convergence boundary. global rates of two methods are established in our paper. addition, show that RCDm has an rate choosing proper parameter. Finally, numerical experiments, both and NARCD faster than RCD for uniformly distributed data. Moreover, better acceleration effect stochastic gradient method. When correlation matrix A stronger, better.
منابع مشابه
Accelerated Coordinate Descent with Adaptive Coordinate Frequencies
Coordinate descent (CD) algorithms have become the method of choice for solving a number of machine learning tasks. They are particularly popular for training linear models, including linear support vector machine classification, LASSO regression, and logistic regression. We propose an extension of the CD algorithm, called the adaptive coordinate frequencies (ACF) method. This modified CD schem...
متن کاملAccelerated Mini-batch Randomized Block Coordinate Descent Method
We consider regularized empirical risk minimization problems. In particular, we minimize the sum of a smooth empirical risk function and a nonsmooth regularization function. When the regularization function is block separable, we can solve the minimization problems in a randomized block coordinate descent (RBCD) manner. Existing RBCD methods usually decrease the objective value by exploiting th...
متن کاملWhen Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent
Coordinate descent (CD) method is a classical optimization algorithm that has seen a revival of interest because of its competitive performance in machine learning applications. A number of recent papers provided convergence rate estimates for their deterministic (cyclic) and randomized variants that differ in the selection of update coordinates. These estimates suggest randomized coordinate de...
متن کاملRows vs Columns for Linear Systems of Equations - Randomized Kaczmarz or Coordinate Descent?
This paper is about randomized iterative algorithms for solving a linear system of equations Xβ = y in different settings. Recent interest in the topic was reignited when Strohmer and Vershynin (2009) proved the linear convergence rate of a Randomized Kaczmarz (RK) algorithm that works on the rows of X (data points). Following that, Leventhal and Lewis (2010) proved the linear convergence of a ...
متن کاملAccelerated Variance Reduced Block Coordinate Descent
Algorithms with fast convergence, small number of data access, and low periteration complexity are particularly favorable in the big data era, due to the demand for obtaining highly accurate solutions to problems with a large number of samples in ultra-high dimensional space. Existing algorithms lack at least one of these qualities, and thus are inefficient in handling such big data challenge. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10224379